Energy-Efficient and Connected D-Hop Dominating Sets in Wireless Sensor Networks

With a small battery equiped in each sensor, a large number of sensor are deployed in a specified area for many different application. Each sensor will perform two simple tasks of collecting (sensing) the surrounding inviroment and delivering the information to the central. While the equiped battery is irreplaceable, many researches concentrate on the extending the networks formed by these sensors by reducing energy usage. This leads to the use of forming a network backbone in wireless sensor networks (WSN) with the minimum energy. Increasing the network lifetime by assigning the role for each sensor node in the network is the problem that fits to the dominating set problem in graph theory. In this paper, we study the forming of D-hop connected dominating sets in WSN. We prove that finding a minimum power level to form a planar unit disk graph among sensors is a NP compleness problem. From this result, we present an algorithm to find a minimum power level in forming a WSN and six different d-hop dominating set algorithms. The result of the comparison are presented in the silmulation result section.